Extremal Functions for Shortening Sets of Paths

نویسنده

  • Paul Wollan
چکیده

Let P1, . . . , Pk be k vertex disjoint paths in a graph G where the ends of Pi are xi, and yi. Let H be the subgraph induced by the vertex sets of the paths. We find edge bounds E1(n), E2(n) such that, 1. If e(H) ≥ E1(|V (H)|), then there exist disjoint paths P ′ 1, . . . , P ′ k where the ends of P ′ i are xi and yi such that | S

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing shortest homotopic cycles on polyhedral surfaces with hyperbolic uniformization metric

The problem of computing shortest homotopic cycles on a surface has various applications in computational geometry and graphics. In general, shortest homotopic cycles are not unique, and local shortening algorithms can become stuck in local minima. For surfaces with negative Euler characteristic that can be given a hyperbolic uniformization metric, however, we show that they are unique and can ...

متن کامل

On the Column Extremal Functions of Forbidden 0-1 Matrices

A 0-1 matrix is a matrix in which every element is either 0 or 1. The weight extremal function ex(n, P ) counts the maximum number of 1’s in an n × n matrix which avoids a pattern matrix P . The column extremal function exk(m,P ) counts the maximum number of columns that a matrix with m rows and k 1’s per column can contain such that the matrix avoids P . Set weight and column extremal function...

متن کامل

TIME-VARYING FUZZY SETS BASED ON A GAUSSIAN MEMBERSHIP FUNCTIONS FOR DEVELOPING FUZZY CONTROLLER

The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...

متن کامل

Exact solution of the hypergraph Turán problem for k-uniform linear paths

A k-uniform linear path of length l, denoted by P (k) l , is a family of k-sets {F1, . . . , Fl} such that |Fi ∩ Fi+1| = 1 for each i and Fi ∩ Fj = ∅ whenever |i − j| > 1. Given a k-uniform hypergraph H and a positive integer n, the k-uniform hypergraph Turán number of H , denoted by exk(n,H), is the maximum number of edges in a k-uniform hypergraph F on n vertices that does not contain H as a ...

متن کامل

Analytic Discs, Global Extremal Functions and Projective Hulls in Projective Space

Using a recent result of Lárusson and Poletsky regarding plurisubharmonic subextensions we prove a disc formula for the quasiplurisubharmonic global extremal function for domains in P. As a corollary we get a characterization of the projective hull for connected compact sets in P by the existence of analytic discs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2006